Solver Independent Modelling of Combinatorial and Optimization Problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GHOST: A Combinatorial Optimization Solver for RTS-related Problems

This paper presents GHOST, a combinatorial optimization solver an RTS AI developer can use as a blackbox to solve any problems encoded by a constraint satisfaction/optimization problem. We show a way to model three very different RTS problems by a constraint satisfaction/optimization problem, each problem belonging to a specific level of abstraction, and test our solver on them, using StarCraft...

متن کامل

Inapproximability of Combinatorial Optimization Problems

We survey results on the hardness of approximating combinatorial optimization problems.

متن کامل

Considering Stochastic and Combinatorial Optimization

Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...

متن کامل

On Solving Combinatorial Optimization Problems

We present a new viewpoint on how some combinatorial optimization problems are solved. When applying this viewpoint to the NP -equivalent traveling salesman problem (TSP), we naturally arrive to a conjecture that is closely related to the polynomialtime insolvability of TSP, and hence to the P −NP conjecture. Our attempt to prove the conjecture has not been successful so far. However, the bypro...

متن کامل

Combinatorial Optimization Problems with Testing

In stochastic versions of combinatorial optimization problems, the goal is to optimize an objective function under constraints that specify the feasible solutions, when some parameters involve uncertainty. We focus on maximizing a linear objective ∑N i=1Wixi, where x1, . . . , xN are the decision variables, W1, . . . ,WN are mutually independent random coefficients, and the constraints are dete...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer Science & Systems Biology

سال: 2010

ISSN: 0974-7230

DOI: 10.4172/jcsb.1000063